Sequential Monte Carlo Filters with Parameters Learning for Commodity Pricing Models

نویسندگان

چکیده

In this article, an estimation methodology based on the sequential Monte Carlo algorithm is proposed, thatjointly estimate states and parameters, relationship between prices of futures contracts spot primary products determined, evolution volatility historical data market (Gold Soybean) are analyzed. Two stochastic models for parameters considered, describe physical measure (associated with price) risk-neutral markets to futures), price dynamics in short-term through reversion mean while that long term futures. Other characteristics such as seasonal patterns, spikes, dependent volatilities, non-seasonality can also be observed. methodology, a parameter learning used, specifically, three algorithms (SMC) state space modelswith unknown parameters: first method considered particle filter sampling importance resampling (SISR). The second implemented Storvik [19], posterior distribution estimated have supported low-dimensional spaces, sufficient statistics from sample filtered considered. third (PLS) Carvalho’s Particle Learning Smoothing [31]. cash future delivery dates results indicate postponement payment, different maturity highly correlated. Likewise, date last periods year 2017, lower than expiration 12 24 months found, opposite occurs 1 6 months.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Monte Carlo Methods for Option Pricing

In the following paper, we provide a review and development of sequential Monte Carlo (SMC) methods ([17, 18, 24]) for option pricing. SMC are a class of Monte Carlo-based algorithms, that are designed to approximate expectations w.r.t a sequence of related probability measures. These approaches have been used, successfully, for a wide class of applications in engineering, statistics and physic...

متن کامل

Direct vs. indirect sequential Monte-Carlo filters

We address the recursive computation of the a posteriori filtering pdf p n|n in a Hidden Markov Chain (HMC). Classically pn|n is computed via the recursion p n−1|n−1 → pn|n−1 → pn|n. In this paper we explore direct, prediction-based (P-based) and smoothing-based (S-based) alternative loops for propagating p n|n. We next address sequential Monte Carlo (SMC) implementations of these filtering pat...

متن کامل

Sequential Monte Carlo methods for graphical models

Inference in probabilistic graphical models (PGMs) does typically not allow for analytical solutions, confining us to various approximative methods. We propose a sequential Monte Carlo (SMC) algorithm for inference in general PGMs. Via a sequential decomposition of the PGM we find a sequence of auxiliary distributions defined on a monotonically increasing sequence of probability spaces. By targ...

متن کامل

Sequential Monte Carlo for Graphical Models

We propose a new framework for how to use sequential Monte Carlo (SMC) algorithms for inference in probabilistic graphical models (PGM). Via a sequential decomposition of the PGM we find a sequence of auxiliary distributions defined on a monotonically increasing sequence of probability spaces. By targeting these auxiliary distributions using SMC we are able to approximate the full joint distrib...

متن کامل

Sequential Monte Carlo Methods for Stochastic Volatility Models with Jumps

In this paper we propose a sequential Monte Carlo algorithm to estimate a stochastic volatility model with leverage effect, non constant conditional mean and jumps. Our idea relies on the auxiliary particle filter algorithm together with the Markov Chain Monte Carlo (MCMC) methodology. Our method allows to sequentially evaluate the parameters and the latent processes involved in the dynamic of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics, Optimization and Information Computing

سال: 2021

ISSN: ['2310-5070', '2311-004X']

DOI: https://doi.org/10.19139/soic-2310-5070-814